Finite groups with few dth roots of 1
نویسندگان
چکیده
منابع مشابه
Finite p-groups with few non-linear irreducible character kernels
Abstract. In this paper, we classify all of the finite p-groups with at most three non linear irreducible character kernels.
متن کاملElements with Square Roots in Finite Groups
In this paper, we study the probability that a randomly chosen element in a finite group has a square root, in particular the simple groups of Lie type of rank 1, the sporadic finite simple groups and the alternating groups.
متن کاملfinite p-groups with few non-linear irreducible character kernels
abstract. in this paper, we classify all of the finite p-groups with at most three non linear irreducible character kernels.
متن کاملRandom Walks on Finite Groups with Few Random Generators
Let G be a finite group. Choose a set S of size k uniformly from G and consider a lazy random walk on the corresponding Cayley graph. We show that for almost all choices of S given k = 2 a log2 |G|, a > 1, this walk mixes in under m = 2a log a a−1 log |G| steps. A similar result was obtained earlier by Alon and Roichman (see [AR]), Dou and Hildebrand (see [DH]) using a different techniques. We ...
متن کاملGraphs With Few Matching Roots
We determine all graphs whose matching polynomials have at most five distinct zeros. As a consequence, we find new families of graphs which are determined by their matching polynomials.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1984
ISSN: 0021-8693
DOI: 10.1016/0021-8693(84)90116-9